U Niversité P Aris Ix Lamsade
نویسنده
چکیده
This thesis concerns the use of reformulation techniques in mathematical programming. Optimization and decision problems can be cast into a formulation involving sets of known numerical parameters, decision variables whose value is to be determined as a result of an algorithmic process, one of more optional objective functions to be optimized and various sets of constraints, which can be either expressed explicitly as functions of the parameters and variables, or as implicit requirements on the variables. These elements, namely parameters, variables, objective(s) and constraints, form a language called mathematical programming. There are usually many different possible equivalent mathematical programming formulations for the same optimization or decision problem. Different formulations often perform differently according to the type of algorithm employed to solve the problem. Furthermore, related auxiliary problems which may be useful during the course of the algorithmic solution process may arise and be also cast as mathematical programming formulations. This thesis is an in-depth study of the symbolic transformations that map a mathematical programming formulation to its equivalent forms and to other useful related formulations, and of their relations to various solution algorithms.
منابع مشابه
Nankai Trough, Japan Trench and Kuril Trench: geochemistry of Fluids sampled by submersible “ Nautile”
' L aboratoire de G éochim ie e l M étallogén ie (C N R S VA 196), U niversité P ierre et M arie Curie, 4 p la ce Jussieu, 75252 P aris C édex 05 (France) ' Faculty o f Science, U niversity o f Tokyo, Bunkyo-ku, T okyo 113 (Japan) ' D 3G M , IF R E M E R , C entre de Brest, B .P. 337, 29273 Brest C édex (France) 4 L aborato ire de Géochimie, U niversité L ibre de Bruxelles, 50 Av. F.D. Roosevel...
متن کامل3 D Reconstruction of Manufactured Parts using a Bi-directional Stereovision-based Contour Matching and Comparison of Real and Synthetic Images
Aïcha Beya F AR L SIIT ( U M R U L P-C N R S 7005) U niversité L ouis Pasteur Bd Sébastien Brant, BP 10413 F -67412 Illkirch-C edex , F rance far@ lsiit.u-strasbg.fr Sophie K O H L E R L SIIT ( U M R U L P-C N R S 7005) U niversité L ouis Pasteur Bd Sébastien Brant, BP 10413 F -67412 Illkirch-C edex , F rance kohler@ lsiit.u-strasbg.fr E rnest H IR SC H L SIIT ( U M R U L P-C N R S 7005) U nive...
متن کاملNucleotide sequences associated with differences in electrophoretic mobility of envelope glycoprotein gp70 and with GIX antigen phenotype of certain murine leukemia viruses.
Previous genetic and biochemical studies led to the identification of two large RNase T1-resistant oligonucleotides, designated the G(IX) (+) and G(IX) (-) oligonucleotides, whose presence in the genomes of closely related murine leukemia viruses is mutually exclusive and predictive of two properties of the viral envelope glycoprotein gp70. Viruses harboring the G(IX) (+) oligonucleotide induce...
متن کاملApproximate solutions of HAPPYNET on cubic graphs
The HAPPYNET problem is defined as follows : Given a undirected simple graph G with integer weights wvu on its edges vu ∈ E(G), find a function s : V (G) −→ {−1, 1} such that ∀v ∈ V (G), v is happy in G, i.e. such that u∈Γ(v) s(v)s(u)wuv ≥ 0. It is easy to see that HAPPYNET has always a solution, no matter what the input is. However, no polynomial algorithm is known for this problem, which is c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007